An Efficient Maintenance Algorithm of Generalized Association Rules for Record Modification
نویسندگان
چکیده
In this paper, an algorithm is proposed based on the concept of pre-large itemsets to maintain discovered generalized association rules for record modification. A pre-large itemset is not truly large, but promises to be large in the future. A lower and an upper support threshold are used to realize this concept. The two user-specified support thresholds make the pre-large itemsets act as a gap to avoid small itemsets becoming large in the updated database when transactions are modified. The proposed algorithm doesn't need to rescan the original database until a number of records have been modified.
منابع مشابه
Maintenance of Generalized Association Rules for Record Deletion Based on the Pre-Large Concept
In the past, we proposed an incremental mining algorithm for maintenance of generalized association rules as new transactions were inserted. Deletion of records in databases is, however, commonly seen in real-world applications. In this paper, we thus attempt to extend our previous approach to solve this issue. The proposed algorithm maintains generalized association rules based on the concept ...
متن کاملA new approach based on data envelopment analysis with double frontiers for ranking the discovered rules from data mining
Data envelopment analysis (DEA) is a relatively new data oriented approach to evaluate performance of a set of peer entities called decision-making units (DMUs) that convert multiple inputs into multiple outputs. Within a relative limited period, DEA has been converted into a strong quantitative and analytical tool to measure and evaluate performance. In an article written by Toloo et al. (2009...
متن کاملAn Efficient Fufp-tree Maintenance Algorithm for Record Modification
The Frequent-Pattern-tree (FP-tree) is an efficient data structure for association-rule mining without the generation of candidate itemsets. It is used to compress a database into a tree structure, which stores only large items. When the underlying data is updated, the FP-tree, however, needs to process all the transactions in a batch way. In this paper, we thus attempt to extend the FP-tree co...
متن کاملIdentifying and Evaluating Effective Factors in Green Supplier Selection using Association Rules Analysis
Nowadays companies measure suppliers on the basis of a variety of factors and criteria that affect the supplier's selection issue. This paper intended to identify the key effective criteria for selection of green suppliers through an efficient algorithm callediterative process mining or i-PM. Green data were collected first by reviewing the previous studies to identify various environmental cri...
متن کاملEfficient Modification of Fast Updated FP-trees Based on Pre-large Concepts
The frequent pattern tree (FP-tree) is an efficient data structure for association-rule mining without generation of candidate itemsets. It is used to compress a database into a tree structure which stores only large items. It, however, needs to process all transactions in a batch way. In this paper, we modify the FUFP-tree maintenance based on the concept of pre-large itemsets for efficiently ...
متن کامل